Universal Communication—Part II: Channels With Memory
نویسندگان
چکیده
منابع مشابه
Universal Communication - Part II: Channels With Memory
Consider communication over a channel whose probabilistic model is completely unknown vector-wise and is not assumed to be stationary. Communication over such channels is challenging because knowing the past does not indicate anything about the future. The existence of reliable feedback and common randomness is assumed. In a previous paper it was shown that the Shannon capacity cannot be attain...
متن کاملUniversal Decoding for Channels with Memory
A universal decoder for a parametric family of channels is a decoder whose structure depends on the family but not on the individual channel over which transmission takes place, and it yet attains the same random-coding error exponent as the maximum-likelihood receiver tuned to the channel in use. The existence and structure of such decoders is demonstrated under relatively mild conditions of c...
متن کاملUniversal Coding for Correlated Sources with Memory
|Universal coding problem for the system of Slepian and Wolf (the SW-system) has rst been investigated by Csisz ar and Korner. They considered the correlated memoryless sources, and established a universally attainable error exponent as a function of rate pair (R1;R2) that is positive whenever (R1; R2) is an inner point of the admissible rate region of the SW-system, which is speci ed dependin...
متن کاملUniversal Decoding for Noisy Channels
A universal decoder for a parametric family of channels is a decoder that for any channel in the family attains the same random coding error exponent as the best decoder for that particular channel. The existence and structure of such decoders is demonstrated under relatively mild conditions of continuity of the channel law with respect to the parameter indexing the family. It is further shown ...
متن کاملDiscrete Denoising for Channels with Memory
We consider the problem of estimating a discrete signal X = (X1, . . . , Xn) based on its noise-corrupted observation signal Z = (Z1, . . . , Zn). The noise-free, noisy, and reconstruction signals are all assumed to have components taking values in the same finite M -ary alphabet {0, . . . , M − 1}. For concreteness we focus on the additive noise channel Zi = Xi + Ni, where addition is modulo-M...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2014
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2014.2321744